Remarks on Self-Inverse Quadratic Permutation Polynomials
نویسندگان
چکیده
Conditions for a quadratic permutation polynomial (QPP) to be self-inverse over the ring Zm of modular integers are given. If m = 2n, necessary and sufficient conditions for a QPP to be self-inverse are determined. Additional properties of QPP over modular integers as well as examples of monomial permutation polynomials are also provided. Mathematics Subject Classification: 12E10, 11B83
منابع مشابه
On Inverses for Quadratic Permutation Polynomials over Integer Rings
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient condition that determines the least degree inverse of a quadratic permutation polynomial is proven. Moreover, an algorithm is provided to explicitly compute th...
متن کاملRemarks on a family of permutation polynomials
We study a family of permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn and f : Fqn → Fq. In particular, we determine the cycle structure and the inverse of such a permutation.
متن کاملA note on permutation polynomials and finite geometries
Let F be a finite field of odd cardinality. A polynomial g in F[x] is called a permutation polynomial if g defines a bijective function on F. We will call a polynomial f in F[x] a difference permutation polynomial if f(x + a) -f(x) is a permutation polynomial for every nonzero a in F. Difference permutation polynomials are a special case of planar functions, as defined by Dembowski [2, p. 2271,...
متن کاملFurther Results on Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Also, the recently proposed quadratic permutation polynomial (QPP) based interleavers by Sun and Takeshita (IEEE Trans. Inf. Theory, Jan. 2005) provide excellent performan...
متن کاملSelf-Inverse Interleavers for Turbo Codes
In this work we introduce and study a set of new interleavers based on permutation polynomials and functions with known inverses over a finite field Fq for using in turbo code structures. We use Monomial, Dickson, Möbius and Rédei functions in order to get new interleavers. In addition we employ Skolem sequences in order to find new interleavers with known cycle structure. As a byproduct we giv...
متن کامل